Reconfigurable Parallel Sorting and Load Balancing on a Beowulf Cluster: HeteroSort
نویسندگان
چکیده
HeteroSort load balances and sorts within static or dynamic networks using a conceptual torus mesh. We ported HeteroSort to a 16-node Beowulf cluster with a central switch architecture. By capturing global system knowledge in overlapping microregions of nodes, HeteroSort is useful in data dependent applications such as data information fusion on distributed processors.
منابع مشابه
Reconfigurable Parallel Sorting and Load Balancing: HeteroSort
HeteroSort load balances and sorts within static or dynamic networks. Upon failure of a node or path, HeteroSort uses a genetic algorithm to minimize the distribution path by optimally mapping the network to physical near neighbor nodes. We include a proof that a final state of HeteroSort (barren best trades of the Wren cycle) is always a detection of termination of sorting. By capturing global...
متن کاملAnalysis of a prototype intelligent network interface
With a focus on commodity PC systems, Beowulf clusters traditionally lack the cutting edge network architectures, memory subsystems, and processor technologies found in their more expensive supercomputer counterparts. Many users find that what Beowulf clusters lack in technology, they more than make up for with their significant cost advantage. In this paper, an architectural extension that add...
متن کاملPerformance Evaluation of Load Sharing Policies with PANTS on a Beowulf Cluster
Powerful, low-cost clusters of personal computers, such as Beowulf clusters, have fueled the potential for widespread distributed computation. While these Beowulf clusters typically have software that facilitates development of distributed applications, there is still a need for effective distributed computation that is transparent to the application programmer. The PANTS Application Node Trans...
متن کاملAn Over-partitioning Scheme for Parallel Sorting on Clusters with Processors Running at different Speeds
In this work we introduce a new algorithm for in-core parallel sorting integer keys which is based on the overpartitioning scheme introduced by Li and Sevcik [1]. The algorithm is devoted to clusters with processors running at different speeds i.e. correlated by a multiplicative constant factor. We compare experimentally this approach with another one related to the Parallel Sorting by Regular ...
متن کاملHistory-Based Adaptive Work Distribution
Exploiting parallelism of increasingly heterogeneous parallel architectures is challenging due to the complexity of parallelism management. To achieve high performance portability whilst preserving high productivity, high-level approaches to parallel programming delegate parallelism management, such as partitioning and work distribution, to the compiler and the run-time system. Random work stea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000